A genetic algorithm-based heuristic for solving the weighted maximum independent set and some equivalent problemsHIFI, M.The Journal of the Operational Research Society. 1997, Vol 48, Num 6, pp 612-622, issn 0160-5682Article

Best-first search and dynamic programming methods for cutting problems : The cases of one or more stock platesHIFI, M; OUAFI, R.Computers & industrial engineering. 1997, Vol 32, Num 1, pp 187-205, issn 0360-8352Article

A dynamic adaptive local search algorithm for the circular packing problem : Cutting and PackingHIFI, M; M'HALLAH, R.European journal of operational research. 2007, Vol 183, Num 3, pp 1280-1294, issn 0377-2217, 15 p.Article

Une amélioration de l'algorithme récursif de Herz pour le problème de découpe à deux dimensions = An improvement of the recursive Herz algorithm for the cutting stock problemHIFI, M; ZISSIMOPOULOS, V.RAIRO. Recherche opérationnelle. 1996, Vol 30, Num 2, pp 111-125, issn 0399-0559Article

Sensitivity analysis of the knapsack sharing problem : Perturbation of the weight of an itemBELGACEM, T; HIFI, M.Computers & operations research. 2008, Vol 35, Num 1, pp 295-308, issn 0305-0548, 14 p.Article

A reactive local search-based algorithm for the disjunctively constrained knapsack problemHIFI, M; MICHRAFY, M.The Journal of the Operational Research Society. 2006, Vol 57, Num 6, pp 718-726, issn 0160-5682, 9 p.Article

Constrained two-dimensional cutting : an improvement of Christofides and Whitlock's exact algorithmHIFI, M; ZISSIMOPOULOS, V.The Journal of the Operational Research Society. 1997, Vol 48, Num 3, pp 324-331, issn 0160-5682Article

An efficient approach for large-scale two-dimensional guillotine cutting stock problemsFAYARD, D; HIFI, M; ZISSIMOPOULOS, V et al.The Journal of the Operational Research Society. 1998, Vol 49, Num 12, pp 1270-1277, issn 0160-5682Article

Heuristic algorithms for the multiple-choice multidimensional knapsack problemHIFI, M; MICHRAFY, M; SBIHI, A et al.The Journal of the Operational Research Society. 2004, Vol 55, Num 12, pp 1323-1332, issn 0160-5682, 10 p.Article